Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое recursively - определение
PROCESS OF REPEATING ITEMS IN A SELF-SIMILAR WAY
Recursion definition; Recursive; Recursivity; Recursionism; Recursively; Infinite Recursion; Recursion, infinite; Recursor function; Recursionisms; Recursion (Concept); Recursion (concept); Recursive routine; Recursions; Recursion principle; Recursive structure; Infinite loop motif; Infinite-loop motif; Recursiveness; Mathematical recursion; Base case (recursion); Recursoin; Recursive step; Recurson; Recursive humour; Recursion in natural languages; Recursion (linguistics)
![Malyutin]], 1892](https://commons.wikimedia.org/wiki/Special:FilePath/First matryoshka museum doll open.jpg?width=200 "Malyutin]], 1892")
![Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).](https://commons.wikimedia.org/wiki/Special:FilePath/Polittico stefaneschi, verso.jpg?width=200 "Front face of [[Giotto]]'s ''[[Stefaneschi Triptych]]'', 1320, recursively contains an image of itself (held up by the kneeling figure in the central panel).")
![[[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail.](https://commons.wikimedia.org/wiki/Special:FilePath/Serpiente alquimica.jpg?width=200 "[[Ouroboros]], an ancient symbol depicting a serpent or dragon eating its own tail.")
![The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal](https://commons.wikimedia.org/wiki/Special:FilePath/Sierpinski triangle.svg?width=200 "The [[Sierpinski triangle]]—a confined recursion of triangles that form a fractal")
![Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.](https://commons.wikimedia.org/wiki/Special:FilePath/Sourdough.jpg?width=200 "Recently refreshed [[sourdough]], bubbling through [[fermentation]]: the recipe calls for some sourdough left over from the last time the same recipe was made.")
Найдено результатов: 133
recursive
recursive
¦ adjective
1. chiefly Mathematics & Linguistics relating to or characterized by recursion.
2. Computing relating to or denoting a program or routine a part of which requires the application of the whole.
Derivatives
recursively adverb
Recursion
·noun The act of recurring; return.
recursion
[r?'k?:?(?)n]
¦ noun chiefly Mathematics & Linguistics the repeated application of a procedure or rule to successive results of the process.
?a recursive procedure or formula.
recursion
<mathematics, programming> When a function (or procedure)
calls itself. Such a function is called "recursive". If the
call is via one or more other functions then this group of
functions are called "mutually recursive".
If a function will always call itself, however it is called,
then it will never terminate. Usually however, it first
performs some test on its arguments to check for a "base case"
- a condition under which it can return a value without
calling itself.
The canonical example of a recursive function is
factorial:
factorial 0 = 1
factorial n = n * factorial (n-1)
Functional programming languages rely heavily on recursion,
using it where a procedural language would use iteration.
See also recursion, recursive definition, tail recursion.
[Jargon File ]
(1996-05-11)
Recursion
Recursion (adjective: recursive) occurs when a thing is defined in terms of itself or of its type. Recursion is used in a variety of disciplines ranging from linguistics to logic.
Computably inseparable
IN COMPUTABILITY THEORY, PAIRS OF SETS OF NATURAL NUMBERS THAT CANNOT BE "SEPARATED" WITH A RECURSIVE SET
Effectively separable; Effectively separable set; Effectively separable sets; Effectively inseparable; Effectively inseparable sets; Recursively separable sets; Recursively separable; Recursively inseparable; Recursive inseparability; Recursively inseparable sets
In computability theory, two disjoint sets of natural numbers are called computably inseparable or recursively inseparable if they cannot be "separated" with a computable set.Monk 1976, p.
Recursive definition
![Four stages in the construction of a [[Koch snowflake]]. As with many other [[fractal]]s, the stages are obtained via a recursive definition.](https://commons.wikimedia.org/wiki/Special:FilePath/KochFlake.svg?width=200 "Four stages in the construction of a [[Koch snowflake]]. As with many other [[fractal]]s, the stages are obtained via a recursive definition.")
DEFINING THE ELEMENTS IN A SET IN TERMS OF OTHER ELEMENTS IN THE SET
Inductive definition; Recursively define; Recursively defined
In mathematics and computer science, a recursive definition, or inductive definition, is used to define the elements in a set in terms of other elements in the set (Aczel 1977:740ff). Some examples of recursively-definable objects include factorials, natural numbers, Fibonacci numbers, and the Cantor ternary set.
Recursively enumerable language
FORMAL LANGUAGE
Partially decidable language; Turing-recognizable language; Turing recognizable; R.e. language; Nonrecursively enumerable; Recognizable language; Turing-acceptable language; Type-0 language; Recursively enumerable languages
In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e.
recursive definition
DEFINING THE ELEMENTS IN A SET IN TERMS OF OTHER ELEMENTS IN THE SET
Inductive definition; Recursively define; Recursively defined
See recursive definition.
Википедия
Recursion
Recursion occurs when the definition of a concept or process depends on a simpler version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. The most common application of recursion is in mathematics and computer science, where a function being defined is applied within its own definition. While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references ("crock recursion") can occur.
A process that exhibits recursion is recursive.
